Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

试析新中国成立初期人民解放军学习苏军活动

新中国成立初期，人民解放军展开了学苏军活动。这次学苏军活动，经历了全面学习、有分析有批判地学习以及确立“以我为主”方针等三个历史阶段。通过学习、借鉴苏军经验，人民解放军技战术水平和协同作战能力有了很大提高，正规化现代化革命化建设取得显著成绩，同时也积累了许多值得借鉴的经验教训。     

在求“变”中推进西南边防部队转型发展

西南边防部队驻防于我国西南边境地区,西起西藏自治区的日土县,东至广西壮族自治区的防城港市,担负着边防管控和边境防御作战等重要职能,在捍卫国家主权和安全中地位作用十分特殊。随着军队调整改革的深入落实,西南边防部队正处于转型重塑的关键时期,必须紧紧围绕新形势、新体制、新职能,着眼应急指挥、军事训练、边境管控、内外环境等关键要素和现实问题,在求"变"中推进创新发展,不断提升履职能力,切实为捍卫国家领土主权完整和维护边境稳定提供坚强保证。     

虚拟现实在心理战中的应用及展望

虚拟现实是用虚拟的情境模拟现实的世界,通过虚拟的多维空间,使用户体验到身临其境的感觉。文章通过深度剖析虚拟现实的历史沿革、发展现状与技术特点,结合其在军事中的运用以及发展前景,提出虚拟现实能够对心理战参战人员的心理训练、战场环境模拟和心理战效果评估提供借鉴和支持。     

论斯大林军事理论的几大亮点(下)

斯大林是苏联共产党和国家主要领导人、武装力量最高统帅，在领导苏联国防建设和反侵略战争的长期实践中，形成了具有自己特色的军事理论。其中，国家要进行积极防御的准备，必须建立和建设一支无产阶级常备军，大力发展国民经济、建立雄厚的国防经济基础，建立和巩固反侵略同盟，经常保持、正确使用战略预备队和用大规模围歼战役歼灭敌军重兵集团，是最引人注目的6个方面。斯大林军事理论总体上适合于他所处的历史条件和实践提出的要求，反映了苏联进行国内战争、军队建设、国防建设和反侵略战争的基本规律，为巩固苏维埃政权，特别是为取得卫国战争的胜利发挥了重要作用。     

VC++和MATCOM结合在飞机基本飞行性能程序开发中的应用

简要分析了Matlab语言在科学工程计算中的优缺点;针对飞机飞行性能计算过程中的一些问题,介绍了一种调用Matcom语言对M文件进行编译,从而与VC 结合编程的新方法.并用实例说明该方法在飞机飞行性能科学计算和计算结果图形绘制中的应用,拓展了软件的应用范围和使用价值.     

Alleviating time inconsistent behaviors via a competition scheme

Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017     

强化部队战斗精神的辩证思考

本文从军队共性与我军个性,历史传统性与时代性,内在精神性与外显物质性,官兵个体性与部队群体性等辩证关系出发,探索强化部队战斗精神的有效途径和科学方法。     

摩步师(团)反空袭作战空中威胁评估

运用定量和定性分析相结合的方法,对摩步师(团)战斗行动中面临的空中威胁进行了分析,提出了评估的方法和步骤,建立了评估模型,并结合实例对评估方法、步骤、模型进行了分析验证.实例计算表明,该方法的判断结果预见性好、可靠性强,对未来摩步师(团)反空袭作战有一定的现实意义.